Termination Analysis of Active Rules with Priorities

This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here a refinement of these works, exploiting the priorities defined between rules. We introduce the notions of path set and destabilizing set. We show how to determine the priority of a path set. The triggering graph can then be reduced thanks to considerations about priorities of the path sets. Much more termination situations can be detected, since priorities are exploited.